Faults Diagnosis Utilizing a Three-Layer Signed Directed Graph.
نویسندگان
چکیده
منابع مشابه
Incipient Fault Diagnosis of Tennessee Eastman Flowsheet using Signed Directed Graph and Trend Analysis
In this article we propose a combined signed directed graph (SDG) and qualitative trend analysis (QTA) framework for incipient fault diagnosis. The SDG is the rst level in our framework and provides a possible candidate set of faults based on the incipient response of the process. The search for the actual fault is performed based on a QTA, which uses the temporal evolution of the sensors for f...
متن کاملDiagnosis of steady-state process behaviour using rules derived from signed directed graph
In this paper, we propose diagnosis of steady-state process behaviour using rules derived from the signed directed graph(SDG) representing the interaction among the process variables. All abnormalities are correlated using backward reasoning through rules to yield a diagnosis. These rules can be added with experimental rules which are obtained from experts on plant operation.
متن کاملMultiple faults diagnosis using causal graph
This work proposes to put up a tool for diagnosing multi faults based on model using techniques of detection and localization inspired from the community of artificial intelligence and that of automatic. The diagnostic procedure to be integrated into the supervisory system must therefore be provided with explanatory features. Techniques based on causal reasoning are a pertinent approach for thi...
متن کاملThe H - Line Signed Graph of a Signed Graph
A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ) (S = (G,μ)) where G = (V, E) is a graph called underlying graph of S and σ : E → (e1, e2, ..., ek) (μ : V → (e1, e2, ..., ek)) is a function, where each ei ∈ {+,−}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. Given a ...
متن کاملDirected prime graph of non-commutative ring
Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$. Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KAGAKU KOGAKU RONBUNSHU
سال: 1991
ISSN: 0386-216X,1349-9203
DOI: 10.1252/kakoronbunshu.17.810